Multitime multiobjective variational problems via η-approximation method

نویسندگان

چکیده

The present article is devoted to multitime multiobjective variational problems via ?-approximation method. In this method, an approach applied the considered problem, and a new problem constructed, called as ?- approximated that contains change in objective both constraints functions. equivalence between efficient (Pareto optimal) solution main derived along with its associated ?-approximated under invexity defined for functional. Furthermore, we have also discussed saddle-point criteria generalized assumptions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proper efficiency and duality for a new class of nonconvex multitime multiobjective variational problems

*Correspondence: [email protected] 1Faculty of Applied Sciences, University ‘Politehnica’ of Bucharest, Splaiul Independenţei, No. 313, Bucharest, 060042, Romania Full list of author information is available at the end of the article Abstract In this paper, a new class of generalized of nonconvex multitime multiobjective variational problems is considered. We prove the sufficient optimality...

متن کامل

Saddle Point Criteria and Duality in Multiobjective Programming via an Η-approximation Method

In this paper, Antczak’s -approximation approach is used to prove the equivalence between optima of multiobjective programming problems and the -saddle points of the associated -approximated vector optimisation problems. We introduce an -Lagrange function for a constructed -approximated vector optimisation problem and present some modified -saddle point results. Furthermore, we construct an -ap...

متن کامل

Pseudoconvex Multiobjective Continuous-time Problems and Vector Variational ‎Inequalities

In this paper, the concept of pseudoconvexity and quasiconvexity for continuous~-time functions are studied and an equivalence condition for pseudoconvexity is obtained. Moreover, under pseudoconvexity assumptions, some relationships between Minty and Stampacchia vector variational inequalities and continuous-time programming problems are presented. Finally, some characterizations of the soluti...

متن کامل

Approximation of Multiobjective Optimization Problems

Approximation of Multiobjective Optimization Problems

متن کامل

Hartley Series Direct Method for Variational Problems

The computational method based on using the operational matrix of anorthogonal function for solving variational problems is computeroriented. In this approach, a truncated Hartley series together withthe operational matrix of integration and integration of the crossproduct of two cas vectors are used for finding the solution ofvariational problems. Two illustrative...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Yugoslav Journal of Operations Research

سال: 2022

ISSN: ['2334-6043', '0354-0243', '1820-743X']

DOI: https://doi.org/10.2298/yjor201115015j